Don't Be Strict in Local Search!

Don't Be Strict in Local Search!

Local Search is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved soluti...

Strict LT2 : Regular : : Local : Recognizable

Strict Local Martingales With Jumps

A strict local martingale is a local martingale which is not a martingale. There are few explicit examples of “naturally occurring” strict local martingales with jumps available in the literature. The purpose of this paper is to provide such examples, and to illustrate how they might arise via filtration shrinkage, a phenomenon we would contend is common in applications such as filtering, contr...

Controller Placement in Software Defined Network using Iterated Local Search

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

A novel local search method for microaggregation

In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...